Completing a (k - 1)-Assignment
نویسندگان
چکیده
Let M be an m× n matrix. A k-assignment is a set of k matrix entries of which no two are in the same row or the same column. The value of a k-assignment is the sum of its entries. A k-assignment is optimal if its value is no larger than the value of any other k-assignment. If the entries of the matrix M are random variables then so is the value of the optimal k-assignment, here denoted by mink(M). The study of the optimal k-assignment has been pursued by researchers from different fields and with different random variables as entries in M. The main focus has been to estimate the size of the expected value of mink(M). For references and more details on the history see [5] or [9]. In 1998 Giorgio Parisi [12] conjectured that if M is a k × k matrix with independent exponential random variables of rate 1, then the expected value of the optimal kassignment is
منابع مشابه
ar X iv : m at h / 04 10 34 7 v 1 [ m at h . C O ] 1 5 O ct 2 00 4 COMPLETING A k − 1 ASSIGNMENT
We consider the distribution of the value of the optimal k-assignment in an m× n-matrix, where the entries are independent exponential random variables with arbitrary rates. We give closed formulas for both the Laplace transform of this random variable and for its expected value under the condition that there is a zero-cost k − 1-assignment.
متن کاملRelating student performance on a family medicine clerkship with completion of Web cases.
BACKGROUND AND OBJECTIVES This study's goal was to determine if completing Web cases improved students' performance on clerkship assessments. METHODS We compared scores on preceptor evaluations, National Board of Medical Examiners (NBME) Subject Exam, and a standardized patient (SP)-based exam using ANCOVA for students choosing to complete assigned cases versus students not completing the ass...
متن کاملComparing Educational, Research and Administrative Activities of Faculty Members Completing their PhD Degree either using Scholarship Funds or not
Introduction: Every year some faculty members continue their education to get their PhD in the form of scholarship, educational assignment, or other ways. Granting scholarship for studying inside or outside the country imposes many problems and high costs to the Ministry of Health and medical universities in Iran. This study aimed to compare the educational, research and administrative performa...
متن کاملTotal vertex irregularity strength of corona product of some graphs
A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum value of the largest label k over all such irregular assignment. In this paper, we study the to...
متن کاملA variant of time minimizing assignment problem
A time minimizing assignment problem (TMAP) dealing with the allocation ofn jobs to m(< n) persons is considered in this paper. One job is to be allocated to exactly one person and each person does at least one job. All the persons start working on the jobs simultaneously. If a person is to do more than one job, he does them one after the other in any order. The aim of the present study is to f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 16 شماره
صفحات -
تاریخ انتشار 2007